A Multidimensional Mapping Mechanism Based Secure Routing Method for DHT
نویسندگان
چکیده
For improving the routing security of traditional DHT, in this paper, a Multidimensional Mapping Mechanism and a secure routing method based on it are proposed against various routing attacks. The proposed mechanism, which maps the resource search and related peers to a smaller space following the same topology with current DHT protocol to simplify the routing operation and decrease the coupling degree between security mechanisms and routing geometry, lays a solid foundation for applying to diversified DHT protocols. The subsequently proposed security measures based on Multidimensional Mapping Mechanism for DHT routing still keeps independent of certain DHT protocol. It pervades throughout the whole routing process, and peers could correct the malicious routing under its security rules. The theoretical analysis and simulation experiment result show that the secure routing method proposed in this paper can improve the average success ratio of lookup through effectively inhibiting
منابع مشابه
Vulnerabilities and Security Threats in Structured Peer-to-Peer Systems: A Quantitative Analysis
A number of recent structured Peer-to-Peer (P2P) systems are built on top of distributed hash table (DHT) based P2P overlay networks. Almost all DHT-based schemes employ a tight-deterministic data placement and ID mapping schemes. This feature on one hand provides assurance on location of data if it exists, within a bounded number of hops, and on the other hand, opens doors for malicious nodes ...
متن کاملA New Framework for Secure Routing in VANET
Vehicular Ad-Hoc Networks can enhance road safety and enable drivers to avoid different threats. Safety applications, mobile commerce, and other information services are among different available services that are affected by dynamic topology, vehicle’s speed and node misbehaving. Dynamic topology makes the route unstable and unreliable. So, improving the throughput and performance of VANET thr...
متن کاملA Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کاملElastic Routing Table with Probable Performance for Congestion Control in DHT Networks
Structured P2P (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of network nodes and the non-uniform and time-varying file popularity. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elasti...
متن کاملA Routing Mechanism by Distance - weighted Bloom Filter *
Bloom filters are used for resource routing and distance-weighted Bloom filters (dwBFs) are used as a concise representation of routing information for scattered resources in overlay networks. Today's DHT-based P2P lookups are always influenced by unnecessarily long routers in the underlay network. The reason is that the false positives appearing in DHT lookup can lead to incorrect direction. T...
متن کامل